one-dimensional optimization meaning in Chinese

一维最优化

Specially , we get the pcg subit - erations numbers of algorithm cf - pcgi by comprehensive studying on a one - dimensional optimization problem in section 3 . 1 . 1
1节中，通过对一个一维最优化问题的详细研究，得到了算法中的pcg子迭代次数。
Newton - pcg algorithm is very efficient for solving the unconstrained optimization problems . we considered an integer one - dimensional optimization problem appeared in newton - pcg method . the efficiency of newton - pcg algorithm is depended on the optimal value of this problem
Newton - pcg算法是解决无约束问题的有效方法，在该算法中需要求解一个一维整数最优化问题，并且算法的效率也依赖于它的最优值。